Pseudo‐Bayesian updating

نویسندگان

چکیده

I propose an axiomatic framework for belief revision when new information is qualitative, of the form “event A at least as likely event B .” My decision maker need not have beliefs about joint distribution signal she will receive and payoff‐relevant states. three axioms, Exchangeability , Stationarity Reduction to characterize class pseudo‐Bayesian updating rules. The key axiom, requires that order in which arrives does matter if different pieces neither reinforce nor contradict each other. show adding one more Conservatism adjust her just enough embrace information, yields Kullback–Leibler minimization: selects posterior closest prior terms divergence from probability measures consistent with newly received information. agents are susceptible recency bias, may be mitigated by repetitive learning.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Updating Homeostasis

10 years ago, a group of us put on an international meeting at the NIH entitled “The Energetic and Dynamic Basis of Health and Aging” [3]. The centerpiece of our conference was the reification of the term homeodynamics [4]. This word was proposed and elaborated by Dr. Gene Yates of UCLA who was a leader of our conference. Homeodynamics extends homeostasis into a more inclusive term. It is evide...

متن کامل

Updating Probabilities

The Method of Maximum (relative) Entropy (ME) has been designed for updating from a prior distribution to a posterior distribution when the information being processed is in the form of a constraint on the family of allowed posteriors. This is in contrast with the usual MaxEnt which was designed as a method to assign, and not to update, probabilities. The objective of this paper is to strengthe...

متن کامل

Updating <=, <-chains

We address the problem of very efficient reasoning and update in ≤, <-chains, where a ≤, <-chain is a directed acyclic graph such that there is a directed path between every pair of vertices, and edges are consistently labelled by ≤ or <. It is easy to show that, subsequent to an O(n) labelling scheme, queries concerning implied ≤ and < relations can be answered in O(1) time. However this schem...

متن کامل

About Updating

Survey of several forms of updating, with a practical illustrative example. We study several updating (conditioning) schemes that emerge naturally from a common scenario to provide some insights into their meaning. Updating is a subtle operation and there is no single method, no single 'good' rule. The choice of the appropriate rule must always be given due consideration. Planchet (1989) presen...

متن کامل

Updating Probabilities

As examples such as the Monty Hall puzzle show, applying conditioning to update a proba­ bility distribution on a "naive space", which does not take into account the protocol used, can often lead to counterintuitive results. Here we exam­ ine why. A criterion known as CAR ("coarsening at random") in the statistical literature character­ izes when "naive" conditioning in a naive space works. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Economics

سال: 2022

ISSN: ['1555-7561', '1933-6837']

DOI: https://doi.org/10.3982/te4535